Birkhoo-von Neumann Input Buuered Crossbar Switches

Switches Cheng-Shang Chang Wen-Jyh Chen Hsiang-Yi Huang Dept. of Electrical Engineering National Tsing Hua University Hsinchu 30043 Taiwan, R.O.C. Email: [email protected] fwjchen, [email protected] Abstract| In our previous paper [5], we proposed a scheduling algorithm that is capable of providing rate guarantees for input-bu ered crossbar switches. The algorithm is based on a decomposition result by Birkho and von Neumann for a doubly substochastic matrix. An input bu ered crossbar switch that uses such an algorithm is called the Birkho -von Neumann switch in this paper. For the Birkho -von Neumann switch, the rate guarantees are uniformly good for all non-uniform tra c, and it does not require framing or internal speedup. Our objective of this paper is to make the Birkho -von Neumann switch more complete and practical. We do so by addressing three topics: providing best-e ort services in the Birkho -von Neumann switch, hardware implementation of the switch fabric, and multistage Birkho -von Neumann switches. Keywords| input bu ered switches, crossbar switches, rate guarantees, scheduling, generalized processor sharing, Banyan networks, rearrangeable networks